A major challenge in quantum computing is to solve general problems withlimited physical hardware. Here, we implement digitized adiabatic quantumcomputing, combining the generality of the adiabatic algorithm with theuniversality of the digital approach, using a superconducting circuit with ninequbits. We probe the adiabatic evolutions, and quantify the success of thealgorithm for random spin problems. We find that the system can approximate thesolutions to both frustrated Ising problems and problems with more complexinteractions, with a performance that is comparable. The presented approach iscompatible with small-scale systems as well as future error-corrected quantumcomputers.
展开▼
